On incremental and robust subspace learning
نویسندگان
چکیده
منابع مشابه
On incremental and robust subspace learning
Principal Component Analysis (PCA) has been of great interest in computer vision and pattern recognition. In particular, incrementally learning a PCA model, which is computationally efficient for large scale problems as well as adaptable to reflect the variable state of a dynamic system, is an attractive research topic with numerous applications such as adaptive background modelling and active ...
متن کاملWeighted and Robust Incremental Method for Subspace Learning
Visual learning is expected to be a continuous and robust process, which treats input images and pixels selectively. In this paper we present a method for subspace learning, which takes these considerations into account. We present an incremental method, which sequentially updates the principal subspace considering weighted influence of individual images as well as individual pixels within an i...
متن کاملWeighted Incremental Subspace Learning
In a cognitive vision system, learning is expected to be a continuous process, which treats input images and pixels selectively. In this paper we present a method for subspace learning, which takes these considerations into account. First, we present a generalized PCA approach, which estimates the principal subspace considering weighted pixels and images. Next, we propose a method for increment...
متن کاملImage retrieval based on incremental subspace learning
Many problems in information processing involve some form of dimensionality reduction, such as face recognition, image/text retrieval, data visualization, etc. The typical linear dimensionality reduction algorithms include principal component analysis (PCA), random projection, locality-preserving projection (LPP), etc. These techniques are generally unsupervised which allows them to model data ...
متن کاملLearning Robust Subspace Clustering
We propose a low-rank transformation-learning framework to robustify subspace clustering. Many high-dimensional data, such as face images and motion sequences, lie in a union of low-dimensional subspaces. The subspace clustering problem has been extensively studied in the literature to partition such highdimensional data into clusters corresponding to their underlying low-dimensional subspaces....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2004
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(03)00431-x